degree of vertex造句

• For solving the problem of finding the degree - constrained minimum spanning tree ( dcmst ) in network design and optimization , a heuristic search method is proposed , in which based on minimum spanning tree , degrees of vertices over the constrained degrees are reduced to the required state
  摘要针对网络设计和优化中度约束最小生成树问题，提出了一种基于贪心思想的启发式算法求解度约束最小生成树。
• This thesis contributes to directed cycles in digraphs , including the relations between the girth g ( d ) ( length of the shortest directed cycle ) of d and degrees of vertices of d and between the shortest directed cycle of d and the binding number of d , among which vertex - transitive digraphs are studied in detail
  本篇论文主要研究有向图中的有向圈，讨论有向图中的围长g ( d ) (最短有向圈的长度)与图的顶点度以及结合数之间的关系，并重点分析了点可迁图类。
• Combining one or more parameters of a graph , many papers either present some upper embeddable graphs ~ [ 7 - 14 ] that is to say , they present the graphs , whose maximum genus reaches the best upper bound , or , they give a better low bound on the maximum genus of some graphs ~ [ 15 - 31 ] the first major result of this paper is that : combining vertex partition and degree of vertices of graphs , to study the upper embeddablity of graphs
  结合图的一个或多个参数，许多文献都给出了若干上可嵌入图类，即给出了最大亏格达到最好上界[ ( g ) 2 ]的图类；或给出一些图类的最大亏格的较好下界。本文的第一个主要结果，根据图的顶点划分和点的度的条件，研究图的上可嵌入性。